A classification of plane and planar 2-trees

نویسندگان

  • Gilbert Labelle
  • Cédric Lamathe
  • Pierre Leroux
چکیده

We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e. a classification of their structures according to their stabilizers. There result explicit formulas in terms of Catalan numbers for their associated generating series, including the asymmetry index series. This work is closely related to the enumeration of polyene hydrocarbons of molecular formula CnHn+2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of the physiological responses of the plane and willow trees against air pollution in Tehran .

Trees can improve air quality, but at the same time, pollution might put them at risk. Plane(Platanus orientalis L) and willow trees (Salix babylonicaL) are important trees in the green space of Tehran. Plane trees in Tehran have experienced early autumn in recent years due to severe air pollution. The present study, investigated some physiological traits of these trees under study to determine...

متن کامل

Orderly Spanning Trees with Applications

We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...

متن کامل

2 J ul 2 00 1 Orderly Spanning Trees with Applications ∗ Hsueh -

We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of a plane graph H of G, and an orderly spanning tree of H. We also...

متن کامل

Really Straight Graph Drawings

We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with ...

متن کامل

Universal Point Sets for Planar Three-Trees

For every n ∈ N, we present a set Sn of O(n log n) points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of Sn. This is the first subquadratic upper bound on the size of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 307  شماره 

صفحات  -

تاریخ انتشار 2003